Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
631	Characteristics and Problems of the Gifted: neural propagation depth and flow motivation as a model of intelligence and creativity Francis HEYLIGHEN ECCO - Evolution, Complexity and Cognition research group Add to Reading List Source URL: pespmc1.vub.ac.be Language: English - Date: 2014-05-02 12:27:37 Science Intelligence Computational neuroscience Cognitive science Problem solving Intellectual giftedness Creativity Neural network Working memory Education Mind Educational psychology
632	A Personal View of Average-Case Complexity Russell Impagliazzo Computer Science and Engineering UC, San Diego 9500 Gilman Drive La Jolla, CA[removed] Add to Reading List Source URL: www.karlin.mff.cuni.cz Language: English - Date: 2011-12-13 09:31:41 Complexity classes Mathematical optimization Structural complexity theory Analysis of algorithms P versus NP problem NP-complete NP Time complexity P Theoretical computer science Computational complexity theory Applied mathematics
633	T D C C  M M Department of Computer Science, University of Cyprus 75 Kallipoleos St., CY-1678 Add to Reading List Source URL: www.cs.ucy.ac.cy Language: English - Date: 2008-07-29 05:34:16 Analysis of algorithms Consensus Time complexity Algorithm Shortest path problem Distributed computing Asymptotically optimal algorithm Asymptotic computational complexity Theoretical computer science Applied mathematics Computational complexity theory
634	Global and reactive routing in urban context: first experiments / first difficulty assessment Pen´elope A. Melgarejo IBM, France Thomas Baudel IBM, France Add to Reading List Source URL: thomas.baudel.name Language: English - Date: 2012-10-30 16:43:40 Computational complexity theory Travelling salesman problem Linear programming Optimization problem Mathematical optimization Constraint programming Shortest path problem Theoretical computer science Mathematics Operations research
635	Subject Information Guide Computability and Intractability MAT4CI Semester 1, 2014 Administration and contact details Host Department Host Institution Add to Reading List Source URL: research.amsi.org.au Language: English - Date: 2014-08-18 08:34:25 Computational complexity theory Structural complexity theory Mathematical optimization Computability theory NP-complete P versus NP problem NP P Low Theoretical computer science Applied mathematics Complexity classes
636	Towards an anticipation control theory of mind Francis Heylighen Evolution, Complexity and Cognition group, Vrije Universiteit Brussel Add to Reading List Source URL: pespmc1.vub.ac.be Language: English - Date: 2014-05-02 12:27:45 Cognition Computational neuroscience Artificial intelligence Mind–body problem Mental processes Embodied cognition Uncertainty Anticipation Consciousness Mind Cognitive science Philosophy of mind
637	Mathematical Problems for the Next Century1 Steve Smale Department of Mathematics City University of Hong Kong Kowloon, Hong Kong August 7, 1998 Add to Reading List Source URL: www6.cityu.edu.hk Language: English - Date: 2012-09-11 23:37:15 Conjectures Millennium Prize Problems Mathematical optimization Complexity classes Diophantine equation Riemann hypothesis Stephen Smale Time complexity P versus NP problem Theoretical computer science Mathematics Computational complexity theory
638	CS255: Cryptography and Computer Security Winter 2001 Final Exam Instructions Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2002-05-13 22:32:41 Cryptographic protocols Electronic commerce Computational hardness assumptions RSA Diffie–Hellman key exchange Diffie–Hellman problem Discrete logarithm Schmidt–Samoa cryptosystem Paillier cryptosystem Cryptography Public-key cryptography Finite fields
639	CS255: Cryptography and Computer Security Winter 2001 Final Exam Instructions Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2003-01-05 20:38:47 Cryptographic protocols Electronic commerce Computational hardness assumptions RSA Diffie–Hellman key exchange Diffie–Hellman problem Discrete logarithm Schmidt–Samoa cryptosystem Paillier cryptosystem Cryptography Public-key cryptography Finite fields
640	Undecidability and Intractability in Theoretical PhysicsPhysical processes are viewed as computations, and the difficulty of answering Add to Reading List Source URL: www.stephenwolfram.com Language: English - Date: 2013-09-24 11:02:15 Computability theory Theory of computation Structural complexity theory Computational problems Cellular automaton Computational irreducibility A New Kind of Science Turing machine P versus NP problem Theoretical computer science Applied mathematics Mathematics

UPDATE